PSPACE-completeness of Modular Supervisory Control Problems*

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PSPACE-completeness of Modular Supervisory Control Problems*

In this paper we investigate computational issues associated with the supervision of concurrent processes modeled as modular discrete-event systems. Here, modular discrete-event systems are sets of deterministic finite-state automata whose interaction is modeled by the parallel composition operation. Even with such a simple model process model, we show that in general many problems related to t...

متن کامل

A Constructive and Modular Approach to Decentralized Supervisory Control Problems

We plunge decentralized control problems into modular ones to benefit from the know-how of modular control theory: any decentralized control problem is associated to a natural modular control problem, which over-approximates it. Then, we discuss how a solution of the latter problem delivers a solution of the former.

متن کامل

PSPACE-completeness of majority automata networks

We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete.

متن کامل

The PSPACE-Completeness of Black-White Pebbling

The complexity of the black-white pebbling game has remained an open problem for 30 years. In this paper we show that the black-white pebbling game is PSPACE-complete.

متن کامل

PSPACE-completeness of the Weighted Poset Game

Poset game, which includes some famous games. e.g., Nim and Chomp as sub-games, is an important two-player impartial combinatorial game. The rule of the game is as follows: For a given poset (partial ordered set), each player intern chooses an element and the selected element and it’s descendants (elements succeeding it) are all removed from the poset. A player who choose the last element is th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Event Dynamic Systems

سال: 2005

ISSN: 0924-6703,1573-7594

DOI: 10.1007/s10626-004-6210-5